package com.sss.hloster0302;
//
import java.util.Scanner;

public class TestPrime {// 求100内的素数

	public static void main(String[] args) {
		test01();
	}

	private static void test01() {
		
		for (int i = 2; i < 100; i++) {
			boolean f = true;
			for (int j = 2; j < i; j++) {
				if (i% j == 0) {
					f = false;
					break;
				}
			}
			if (f == true) {
				System.out.print(i + "   ");
			}
		}
	}
}
